On Quantifying Literals in Boolean Logic and its Applications to Explainable AI

Quantified Boolean logic results from adding operators to for existentially and universally quantifying variables. This extends the reach of by enabling a variety applications that have been explored over decades. The existential quantification literals (variable states) its also studied in literature. In this paper, we complement studying universal literal applications, particularly explainable AI. We provide novel semantics quantification, discuss interplay between variable/literal existential/universal quantification. further identify some classes formulas circuits on which can be done efficiently. Literal is more fine-grained than variable as latter defined terms former. leads refinement quantified with primitive.